XML Tuple Algebra
نویسندگان
چکیده
DEFINITION An XML tuple-based algebra operates on a domain that consists of sets of tuples whose attribute values are items, i.e., atomic values or XML elements (and hence, possibly, XML trees). Operators receive one or more sets of tuples and produce a set, list or bag of tuples of items. It is common that the algebra has special operators for converting XML inputs into instances of the domain and vice versa. XML tuple-based algebras, as is also the case with relational algebras, have been extensively used in query processing and optimization. [1, 3, 2, 4, 6, 5, 7, 9, 10, 8]
منابع مشابه
Integrating Structural Joins into a Tuple-Based XPath Algebra
Over the recent years, very little effort has been made to give XPath a proper algebraic treatment. The only laudable exception is the Natix Algebra (NAL) which defines the translation of XPath queries into algebraic expressions in a concise way, thereby enabling algebraic optimizations. However, NAL does not capture various promising core XML query evaluation algorithms like, for example, the ...
متن کاملSemantic Query Optimization in an Automata-Algebra Combined XQuery Engine over XML Streams
Our Raindrop framework [6, 9] aims at tackling challenges of stream processing that are particular to XML. In contrast to the tuple-based or object-based data streams, XML streams are usually modeled as a sequence of primitive tokens, such as a start tag, an end tag or a PCDATA item. Unlike a self-contained tuple or object whose semantics are completely determined by its own values, a token lac...
متن کاملTowards a physical XML independent XQuery/SQL/XML engine
There has been a lot of research and industrial effort on building XQuery engines with different kinds of XML storage and index models. However, most of these efforts focus on building either an efficient XQuery engine with one kind of XML storage, index, view model in mind or a general XQuery engine without any consideration of the underlying XML storage, index and view model. We need an under...
متن کاملStreamTX: extracting tuples from streaming XML data
We study the problem of extracting flattened tuple data from streaming, hierarchical XML data. Tuple-extraction queries are essentially XML pattern queries with multiple extraction nodes. Their typical applications include mapping-based XML transformation and integrated (set-based) processing of XML and relational data. Holistic twig joins are known for the optimal matching of XML pattern queri...
متن کاملAdvanced Cardinality Estimation in the XML Query Graph Model
Reliable cardinality estimation is one of the key prerequisite for effective cost-based query optimization in database systems. The XML Query Graph Model (XQGM) is a tuple-based XQuery algebra that can be used to represent XQuery expressions in native XML database management systems. This paper enhances previous works on reliable cardinality estimation for XQuery and introduces several inferenc...
متن کامل